Largeness Avoidance in Availability Modeling using Hierarchical and Fixed-point Iterative Techniques
نویسندگان
چکیده
Accurate modeling of availability is a practical problem in today’s complex high-availability systems. But as the system gets more complex, the state-space required for accurate modeling tends to grow very fast. In order to mitigate the largeness in model generation / solution, the system model could be divided into subsystem models, and solution for sub-models can be combined to yield overall model solution. Such hierarchical composition techniques reduce the state-space tremendously. But simple hierarchical techniques provide exact results only when sub-model solutions are independent. In many scenarios, some components or procedures are shared across subsystems, which violate independence in sub-model solution. Hence approximation techniques like nearly independent systems are required to model systems where submodel solutions are dependent. This paper demonstrates approximation techniques for availability modeling for a fluid pressure control system using the concepts of nearly independent subsystems and fixed-point iteration.
منابع مشابه
Dependability Analysis of Large-scale Distributed Systems Using Stochastic Petri Nets
Dependability models of complex distributed systems using Markovian techniques suffer from state space explosion. Several methods for controlling the state space explosion problem have been proposed in the literature. These largeness avoidance methods include state truncation, model composition, behavioral decomposition, time-scale decomposition and fixed-point iteration. In this paper we brief...
متن کاملA Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملSome Fixed Point Results on Intuitionistic Fuzzy Metric Spaces with a Graph
In 2006, Espinola and Kirk made a useful contribution on combining fixed point theoryand graph theory. Recently, Reich and Zaslavski studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In this paper, by using the main idea of their work and the idea of combining fixed point theory on intuitionistic fuzzy metric spaces and graph theory, ...
متن کاملIterative scheme based on boundary point method for common fixed point of strongly nonexpansive sequences
Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...
متن کامل